Wiretap: an experimental multiple-path routing algorithm
نویسندگان
چکیده
منابع مشابه
Wiretap: An Experimental Multiple-Path Routing Algorithm1,2,3
This paper introduces Wiretap, an experimental routing algorithm which computes maximum-likelihood diversity routes for packet-radio stations sharing a common broadcast channel, but with some stations hidden from others. The wiretapper observes the paths (source routes) used by other stations sending traffic on the channel and, using a heuristic set of factors and weights, constructs speculativ...
متن کاملMultiple path routing algorithm for IP networks
Internet routing protocols, such as Open Shortest Path First (OSPF), compute a shortest path tree from each node to other nodes in the network, using link-state information. Such protocols do not consider the queueing situation at a given node. An alternate path of higher cost may be more convenient to use than the optimum path when a long queue is present at the node. This paper proposes a new...
متن کاملOptical packet switching with multiple path routing
The performance of packet-switching wavelength routed optical networks critically depends on packet contentions at the intermediate routers. This paper shows through simulations that de ̄ection routing is an eective technique for packet-switching wavelength routed optical networks with irregular meshed topologies. It is shown that multiple path routing (MPR) as the de ̄ection rule mitigates the ...
متن کاملA Multi-path Hybrid Routing Algorithm in Network Routing
The shortest path tree construction is essential in network routing, and the Dijkstra algorithm, which is a static routing algorithm, is widely used. When some links in a network have new weights, dynamic routing algorithms are more efficient than static routing algorithms. This is because the dynamic routing algorithms reduce redundancy by recomputing only the affected sections of the network ...
متن کاملA Hybrid Routing Algorithm for an Efficient Shortest Path Decision in Network Routing
Recently, shortest path tree construction is essential in network routing. Dijkstra algorithm, one of the static routing algorithms, is widely used. When some links develop new weights, dynamic routing algorithms become more efficient than static routing algorithms. This is because dynamic routing algorithms reduce the redundancy caused by re-computing the affected part of the network in regard...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGCOMM Computer Communication Review
سال: 1989
ISSN: 0146-4833
DOI: 10.1145/66093.66098